Linear parametric model checking of timed automata
نویسندگان
چکیده
منابع مشابه
Linear Parametric Model Checking of Timed Automata
We present an extension of the model checker Uppaal capable of synthesize linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of the (parametric) state-space is shown to be correct. A second contribution of this paper is the identification of a subclass of parametric timed automata (L/U automata), for which the emptiness problem is decidabl...
متن کاملLTL Model Checking of Parametric Timed Automata
The parameter synthesis problem for timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The proposed problem could be solved using an explicit enumeration of all possible parameter valuations. However, we introduce a symb...
متن کاملBounded Model Checking for Parametric Timed Automata
The paper shows how bounded model checking can be applied to parameter synthesis for parametric timed automata with continuous time. While it is known that the general problem is undecidable even for reachability, we show how to synthesize a part of the set of all the parameter valuations under which the given property holds in a model. The results form a complete theory which can be easily app...
متن کاملModel Checking Timed Automata
The theory of timed automata provides a formal framework to model and to verify the correct functioning of real-time systems. Among the di erent veri cation problems that have been investigated within this theory, the so-called reachability problem has been the most throughly studied. This problem is stated as follows. Given two states of the system, is there an execution starting at one of the...
متن کاملModel Checking Timed Automata
Different time scales do often occur in real-time systems, e.g., a polling real-time system samples the environment many times per second, whereas the environmentmay only change a few times per second. When these systems are modeled as (networksof) timed automata, the verification using symbolic model checking techniques can signif-icantly be slowed down by unnecessary fragmenta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2002
ISSN: 1567-8326
DOI: 10.1016/s1567-8326(02)00037-1